An Implement of Parallel Module Network Learning Algorithm on Distributed Memory Multiprocessors*
نویسندگان
چکیده
As an extension of Bayesian Network, Module Network is good for dealing with problems where there are many variables but only a small set of data available. However it’s still time-consuming to learn a Module Network. In this paper, we propose a parallel implementation of the Module Network learning algorithm based on the message passing model. In order to solve the load-imbalance problem introduced by either result caching or intrinsic computation, we propose a grouping strategy, which groups computations by modules and then distributed them cyclically. We tested our algorithm on eight 4-way Intel Xeon multiprocessors. Speedups of 29.26 on 32 processors have been observed. The result shows that our algorithm is effective.
منابع مشابه
Interleaving Partitions of Systolic Algorithms for Programming Distributed Memory Multiprocessors
In this paper we present a systematic method for mapping systolizable problems onto Distributed Memory Multiprocessors. A systolizable problem is a problem for which it is possible to design a Systolic Algorithm. As a first stage, we design a Systolic Algorithm for the problem to be solved. Then, different transformations are applied to this Systolic Algorithm in order to adapt it to the availa...
متن کاملMapping Of Backpropagation Learning Onto Distributed Memory Multiprocessors
This paper presents a mapping scheme for p a d e l pipelined execution of the Backpropagation Learning Algorithm o n dtktributed memory multiprocessors (DMMs). The proposed implementation ezhibits training set parallelism that involves batch updating. Simple algorithms have been presented, which allow the data transfer involved in both forward and backward execution3 phases of the backpropagati...
متن کاملParallel Cache Management of a RDBMS 1
Increasing requirements such as higher transaction rates, shorter response times etc., make it necessary to parallelize existing database management systems and to implement them on multiprocessors. Shared memory multiprocessors are not arbitrarily scalable, and thus do not meet future requirements. Therefore, it makes sense to implement databases on large-scale distributed memory multicomputer...
متن کاملAn efficient mapping of Boltzmann Machine computations onto distributed-memory multiprocessors
Oh, D.H., J.H. Nang, H. Yoon and S.R. Maeng, An efficient mapping of Boltzmann Machine computations onto distributedmemory multiprocessors, Microprocessing and Microprogramming 33 (1991/92) 223-236. In this paper, an efficient mapping scheme of Boltzmann Machine computations onto a distributed-memory multiprocessor, which exploits the synchronous spatial parallelism, is presented. In this schem...
متن کاملDecision Trees on Parallel Processors
A framework for induction of decision trees suitable for implementation on shared-and distributed-memory multiprocessors or networks of workstations is described. The approach , called Parallel Decision Trees (PDT), overcomes limitations of equivalent serial algorithms that have been reported by several researchers, and enables the use of the very-large-scale training sets that are increasingly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005